Перевод: со всех языков на все языки

со всех языков на все языки

modulo N residue

См. также в других словарях:

  • Residue number system — A residue number system (RNS) represents a large integer using a set of smaller integers, so that computation may be performed more efficiently. It relies on the Chinese remainder theorem of modular arithmetic for its operation, a mathematical… …   Wikipedia

  • residue — noun Etymology: Middle English, from Anglo French, from Latin residuum, from neuter of residuus left over, from residēre to remain Date: 14th century something that remains after a part is taken, separated, or designated or after the completion… …   New Collegiate Dictionary

  • Quadratic residue — In number theory, an integer q is called a quadratic residue modulo n if it is congruent to a perfect square modulo n; i.e., if there exists an integer x such that: Otherwise, q is called a quadratic nonresidue modulo n. Originally an abstract… …   Wikipedia

  • Quadratic residue code — A quadratic residue code is a type of cyclic code.There is a quadratic residue code of length pover the finite field GF(l) whenever pand l are primes, p is odd andl is a quadratic residue modulo p.Its generator polynomial as a cyclic code is… …   Wikipedia

  • Reduced residue system — A reduced residue system modulo n is a set of phi( n ) integers such that each integer is relatively prime to n and no two are congruent modulo n . Here phi denotes Euler s totient function.Facts*If { r 1, r 2, dots, r {varphi(n)} } is a reduced… …   Wikipedia

  • Multiplicative group of integers modulo n — In modular arithmetic the set of congruence classes relatively prime to the modulus n form a group under multiplication called the multiplicative group of integers modulo n. It is also called the group of primitive residue classes modulo n. In… …   Wikipedia

  • остаток по модулю N — — [Л.Г.Суменко. Англо русский словарь по информационным технологиям. М.: ГП ЦНИИС, 2003.] Тематики информационные технологии в целом EN modulo N residue …   Справочник технического переводчика

  • Modular arithmetic — In mathematics, modular arithmetic (sometimes called clock arithmetic) is a system of arithmetic for integers, where numbers wrap around after they reach a certain value the modulus. The Swiss mathematician Leonhard Euler pioneered the modern… …   Wikipedia

  • Euler's criterion — In mathematics, Euler s criterion is used in determining in number theory whether a given integer is a quadratic residue modulo a prime. DefinitionEuler s criterion states: Let p be an odd prime and a an integer coprime to p . Then a is a… …   Wikipedia

  • Dirichlet character — In number theory, Dirichlet characters are certain arithmetic functions which arise from completely multiplicative characters on the units of . Dirichlet characters are used to define Dirichlet L functions, which are meromorphic functions with a… …   Wikipedia

  • Quadratic reciprocity — The law of quadratic reciprocity is a theorem from modular arithmetic, a branch of number theory, which shows a remarkable relationship between the solvability of certain quadratic equations modulo different prime moduli.Although it allows us to… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»